- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
Works by Albert A. Mullin
30 found
Order:
- C. S. S. Peirce and E. G. A. Husserl on the nature of logic.Albert A. Mullin - 1966 - Notre Dame Journal of Formal Logic 7 (4):301-304.
- A note on a weakened Goldbach-like conjecture.Albert A. Mullin - 1962 - Notre Dame Journal of Formal Logic 3 (2):118-119.
- Correlative remarks concerning elementary number theory, groups and mutant sets.Albert A. Mullin - 1961 - Notre Dame Journal of Formal Logic 2 (4):253-254.
- Mathematico-philosophical remarks on new theorems analogous to the fundamental theorem of arithmetic.Albert A. Mullin - 1965 - Notre Dame Journal of Formal Logic 6 (3):218-222.
- On a proper class and related matters.Albert A. Mullin - 1966 - Notre Dame Journal of Formal Logic 7 (1):101-102.
- On differences of certain structured sets.Albert A. Mullin - 1963 - Notre Dame Journal of Formal Logic 4 (2):158-160.
- On new theorems for elementary number theory.Albert A. Mullin - 1967 - Notre Dame Journal of Formal Logic 8 (4):353-356.
- Some theorems on the structure of mutant sets and their applications to group and ring theories.Albert A. Mullin - 1962 - Notre Dame Journal of Formal Logic 3 (3):148-151.
- A Contribution Toward Computable Number Theory.Albert A. Mullin - 1965 - Mathematical Logic Quarterly 11 (2):117-119.
- A Contribution Toward Computable Number Theory.Albert A. Mullin - 1965 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 11 (2):117-119.
- Elementary relations between the fundamental theorem of arithmetic, schnirelmann's classical theorem, and goldbach's conjecture.Albert A. Mullin - 1964 - Mathematical Logic Quarterly 10 (13‐17):199-201.
- Elementary Relations Between the Fundamental Theorem of Arithmetic, schnirelmann's Classical Theorem, and goldbach's Conjecture.Albert A. Mullin - 1964 - Mathematical Logic Quarterly 10 (13-17):199-201.
- N. V. Bélákin. Modélirovanié mašin T'úringa na sétkah . Diskrétnyj analiz, no. 1 , pp. 32–41.Albert A. Mullin - 1972 - Journal of Symbolic Logic 37 (1):199.
- On a final multiplicative formulation of the fundamental theorem of arithmetic.Albert A. Mullin - 1964 - Mathematical Logic Quarterly 10 (9‐12):159-161.
- On a final multiplicative formulation of the fundamental theorem of arithmetic.Albert A. Mullin - 1964 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 10 (9-12):159-161.
- On A Necessary Condition for the Validity of Goldbach's Conjecture.Albert A. Mullin - 1963 - Mathematical Logic Quarterly 9 (10):145-148.
- On A Necessary Condition for the Validity of Goldbach's Conjecture.Albert A. Mullin - 1963 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 9 (10):145-148.No categories
- On A Theorem Equivalent to Post's Fundamental Theorem of Recursive Function Theory.Albert A. Mullin - 1963 - Mathematical Logic Quarterly 9 (12‐15):203-205.
- On A Theorem Equivalent to Post's Fundamental Theorem of Recursive Function Theory.Albert A. Mullin - 1963 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 9 (12-15):203-205.No categories
- Lupanov O. B.. Ob odnom métodé sintéza shém . Izvéstiá vysših učébnyh zavédénij, Radiofizika, no. 1 , pp. 120–140.Albert A. Mullin - 1970 - Journal of Symbolic Logic 35 (4):593-594.
- Andreas Weiermann. An application of results by Hardy, Ramanujan and Karamata to Ackermannian functions. Discrete Mathematics and Theoretical Computer Science, vol. 6 no. 1 , pp. 133–141. [REVIEW]Albert A. Mullin - 2005 - Bulletin of Symbolic Logic 11 (1):89-89.
- Discrete Mathematics and Theoretical Computer Science. [REVIEW]Albert A. Mullin - 2005 - Bulletin of Symbolic Logic 11 (1):89-89.
- Fréjvald R.. Složnost' raspoznavaniá simmétrii na mašinah T'uringa s vhodom . Algébra l logika, Séminar, vol. 4 no. 1 , pp. 47–58.Barzdin' Á. M.. Složnost' raspoznavaniá simmétrii na mašinah T'úringa . Problémy kibérnětiki, vol. 15 , pp. 245–248. [REVIEW]Albert A. Mullin - 1970 - Journal of Symbolic Logic 35 (1):159-159.
- Hennie Frederick C. III., Iterative arrays of logical circuits. M.I.T. Press research monograph. The M.I.T. Press, Cambridge, Mass., and John Wiley Sons, Inc., New York and London, 1961, x + 242 pp. [REVIEW]Albert A. Mullin - 1962 - Journal of Symbolic Logic 27 (1):106-107.
- N. V. Bélákin. Vyčislénié efféktivnyh opératorov na mašinah T'úringa s ograničénnym stiraniém . Algébra i logika, Séminar, vol. 2 no. 1 , pp. 19–23. [REVIEW]Albert A. Mullin - 1972 - Journal of Symbolic Logic 37 (1):198.
- Review: Frederick C. Hennie III, Iterative Arrays of Logical Circuits. [REVIEW]Albert A. Mullin - 1962 - Journal of Symbolic Logic 27 (1):106-107.
- Review: N. V. Belakin, Computation of Effective Operators on Turing Machines with Restricted Erasure. [REVIEW]Albert A. Mullin - 1972 - Journal of Symbolic Logic 37 (1):198-198.
- Review: N. V. Belakin, Simulation of Turing Machines on Nets. [REVIEW]Albert A. Mullin - 1972 - Journal of Symbolic Logic 37 (1):199-199.
- Review: O. B. Lupanov, On a Method of Circuit Synthesis. [REVIEW]Albert A. Mullin - 1970 - Journal of Symbolic Logic 35 (4):593-594.
- Review: R. Frejvald, Complexity of Recognition of Symmetry on Turing Machines with Input; A. M. Barzdin, Complexity of Recognition of Symmetry on Turing Machines. [REVIEW]Albert A. Mullin - 1970 - Journal of Symbolic Logic 35 (1):159-159.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-5ff6c685cb-rv6xt uwo